Parametric Tabu Search for 0-1 Mixed Integer Programming: a Computational Study
نویسندگان
چکیده
We present a computational study of parametric tabu search for solving 0-1 mixed integer programming (MIP) problems, a generic heuristic for general MIP problems. This approach solves a series of linear programming problems by incorporating branching inequalities as weighted terms in the objective function. New strategies are proposed for uncovering feasible and high-quality solutions and extensive computational tests are performed on instances from the literature.
منابع مشابه
Flow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
متن کاملLTO Heuristics for Capacitated Lot Sizing Problem with Sequence Dependent Setups and Overtimes
The wellknown CLSP problem is generalized including sequence dependent setup times and overtimes and modeling it as a quadratic mixed 0-1 integer programming problem called Capacitated Lot Sizing Problem with Sequence Dependent Setups and Overtimes. We develop a heuristics based on Lagrangean relaxation and tabu search for solving the problem. At the end, some computational results are presented.
متن کاملAn Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs
First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...
متن کاملParametric tabu-search for mixed integer programs
Aparametric form of tabu-search is proposed for solvingmixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying branching inequalities as weighted terms in the objective function. The approach extends and modifies a parametric branch and bound procedure of Glover [Parametic branch and bound. OMEGA, The International Journal of Manag...
متن کاملThe Airport Gate Assignment Problem: Mathematical Model and a Tabu Search Algorithm
In this paper, we consider an Airport Gate Assignment Problem that dynamically assigns airport gates to scheduled ights based on passengers' daily origin and destination ow data. The objective of the problem is to minimize the overall connection times that passengers walk to catch their connection ights. We formulate this problem as a mixed 0-1 quadratic integer programming problem and then ref...
متن کامل